Vertex Guarding for Dynamic Orthogonal Art Galleries

We devise an algorithm for surveying a dynamic orthogonal polygonal domain by placing one guard at each vertex in subset of its vertices, i.e., whenever [Formula: see text] is modified to result another text], our updates the set guards so that updated surveys text]. Our modifies placement amortized time, while ensuring with holes and vertices guarded using most guards. For special case initial polygon being hole-free update resulting polygon, takes worst-case time. Here, are number before after update, respectively; and, sum few structures maintained algorithm. Further, giving construction, we show it suffices consider only which parity reflex both equal.